Enumerating Integer Points in Polytopes with Bounded Subdeterminants
نویسندگان
چکیده
We show that one can enumerate the vertices of convex hull integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, time polynomial dimension encoding size polytope. This extends a previous result by Artmann et al. who showed linear optimization such be done time.
منابع مشابه
Enumerating Integer Projections of Parametric Polytopes: A Direct Approach
Many compiler techniques depend on the ability to count the number of integer points that satisfy a given set of linear inequalities. Typically, a subset of the variables are identified as the parameters ~ p and the number of possible values for the other, “counted” variables ~y needs to be counted as a function of those parameters. If each variable is either a parameter or counted, then the pr...
متن کاملInteger Points in Knapsack Polytopes and s-Covering Radius
Given a matrix A ∈ Zm×n satisfying certain regularity assumptions, we consider for a positive integer s the set Fs(A) ⊂ Zm of all vectors b ∈ Zm such that the associated knapsack polytope P (A, b) = {x ∈ R>0 : Ax = b} contains at least s integer points. We present lower and upper bounds on the so called diagonal s-Frobenius number associated to the set Fs(A). In the case m = 1 we prove an optim...
متن کاملEnumerating Triangulations of Convex Polytopes
A triangulation of a finite point set A in IRd is a geometric simplicial complex which covers the convex hull of A and whose vertices are points of A. We study the graph of triangulations whose vertices represent the triangulations and whose edges represent geometric bistellar flips. The main result of this paper is that the graph of triangulations in three dimensions is connected when the poin...
متن کاملA problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
We consider the problem of developing an efficient algorithm for enumerating the extreme points of a convex polytope specified by linear constraints. Murty and Chung [8] introduced the concept of a segment of a polytope, and used it to develop some steps for carrying out the enumeration efficiently until the convex hull of the set of known extreme points becomes a segment. That effort stops wit...
متن کاملPoints in Two Polytopes
We propose a separating-hyperplane algorithm for finding a nearest pair of points in two polytopes, where each polytope is expressed as the convex hull of given points in a Euclidian space. The proposed algorithm is an extension of the authors dual algorithm for finding t.he minimum-norm point in a polytope.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2022
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/21m139935x